Dijkstra ' s Self - Stabilizing Algorithm inUnsupportive
نویسنده
چکیده
منابع مشابه
Color Optimal Self-Stabilizing Depth-First Token Circulation
The notion of self-stabilization was rst introduced by Dijkstra : it is the property for a system to eventually recover itself a legitimate state after any perturbation modifying the memory state. This paper proposes a self-stabilizing depth-rst token circulation protocol for uniform rooted networks. Such an algorithm is very convenient to obtain the mutual exclusion or to construct a spanning ...
متن کاملOptimality and Self-Stabilization Over Acyclic Distributed Systems
Self-stabilization was rst introduced by Dijkstra Dij74]: it is the property for a system to eventually recover itself a legitimate state after any perturbation modifying the memory state. In its pioneering paper, Dijkstra proposed three algorithms for token ring systems. Such systems are very useful to solve distributed mutual exclusion. Using the token deenition introduced by Dijkstra, i.e. t...
متن کاملA Self-stabilizing Algorithm with Tight Bounds for Mutual Exclusion on a Ring
In [Dij74] Dijkstra introduced the notion of self-stabilizing algorithms and presented, among others, an algorithm with three states for the problem of mutual exclusion on a ring of processors. In this work we present a new three state self-stabilizing algorithm for mutual exclusion, with a tight bound of 56n 2 +O(n) for the worst case complexity, which is the number of moves of the algorithm u...
متن کاملVerifying a Self - Stabilizing Mutual Exclusion
We present a detailed description of a machine-assisted veriication of an algorithm for self-stabilizing mutual exclusion that is due to Dijkstra Dij74]. This veriication was constructed using PVS. We compare the mechanical veriication to the informal proof sketch on which it is based. This comparison yields several observations regarding the challenges of formalizing and mechanically verifying...
متن کاملHighly Space-Efficient Self-Stabilizing Depth-First Token Circulation for Trees
Self-stabilization was rst introduced by Dijkstra Dij74]: it is the property for a system to eventually recover itself a legitimate state after any perturbation modifying the memory state. Since Dijkstra original paper, the goal of many works has been to obtain self-stabilizing algorithms requiring the fewest possible number of states. A great deal of proposed algorithms are token circulations,...
متن کامل